Multi-type display calculus for propositional dynamic logic
نویسندگان
چکیده
منابع مشابه
Multi-type display calculus for propositional dynamic logic
We introduce a multi-type display calculus for Propositional Dynamic Logic (PDL). This calculus is complete w.r.t. PDL, and enjoys Belnap-style cut-elimination and subformula property.
متن کاملMulti-type display calculus for dynamic epistemic logic
In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoreti...
متن کاملMulti-type Display Calculus for Semi De Morgan Logic
Semi De Morgan algebras form a variety of normal distributive lattice expansions [7] introduced by H.P. Sankappanavar [16] as a common abstraction of De Morgan algebras and distributive pseudocomplemented lattices. A fully selfextensional logic SDM naturally arises from semi De Morgan algebras, which has been studied from a duality-theoretic perspective [13], from the perspective of canonical e...
متن کاملA refined calculus for Intuitionistic Propositional Logic
Since 1993, when Hudelmaier developed a O(n logn)-space decision procedure for propositional intuitionistic logic, a lot of work has been done to improve the efficiency of the related proof-search algorithms. This has been done working on proof-search strategies and on implementation structures more than on logical properties of the calculi. In this paper we provide a tableau calculus using the...
متن کاملA Schemata Calculus for Propositional Logic
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a parameter). Iterated conjunctions or disjunctions are part of their syntax. We define a sound and complete (w.r.t. satisfiability) tableaux-based proof procedure for this language. This schemata calculus (called stab)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2014
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exu064